Graph Node Strength Histogram Publication Method with Node Differential Privacy
نویسندگان
چکیده
منابع مشابه
Towards Accurate Histogram Publication under Differential Privacy
Histograms are the workhorse of data mining and analysis. This paper considers the problem of publishing histograms under differential privacy, one of the strongest privacy models. Existing differentially private histogram publication schemes have shown that clustering (or grouping) is a promising idea to improve the accuracy of sanitized histograms. However, none of them fully exploits the ben...
متن کاملAnalyzing Graphs with Node Differential Privacy
We develop algorithms for the private analysis of network data that provide accurate analysis of realistic networks while satisfying stronger privacy guarantees than those of previous work. We present several techniques for designing node differentially private algorithms, that is, algorithms whose output distribution does not change significantly when a node and all its adjacent edges are adde...
متن کاملBillion-Node Graph Challenges
Graph is a universal model in big data era and finds its wide applications in a variety of real world tasks. The recent emergence of big graphs, especially those with billion nodes, poses great challenges for the effective management or mining of these big graphs. In general, a distributed computing paradigm is necessary to overcome the billion-node graph challenges. In this article, we elabora...
متن کاملAttributed graph transformation with node type inheritance
The aim of this paper is to integrate typed attributed graph transformation with node type inheritance. Borrowing concepts from object oriented systems, the main idea is to enrich the attributed type graph with an inheritance relation and a set of abstract nodes. In this way, a node type inherits the attributes and edges of all its ancestors. Based on these concepts, it is possible to define ab...
متن کاملGraph Decomposition Using Node Labels
Dynamic programming is a method in which the solution to a computational problem is found by combination of already obtained solutions to subproblems. This method can be applied to problems on graphs (nodes connected by edges). The graph of interest must then be broken down into successively smaller parts according to some suitable principle. The thesis studies two graph algebras introduced for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1757/1/012186